منابع مشابه
When are plurality rule voting games dominance-solvable?
This paper studies the dominance-solvability (by iterated deletion of weakly dominated strategies) of plurality rule voting games. For any number of alternatives and at least four voters, we find sufficient conditions for the game to be dominance-solvable (DS) and not to be DS. These conditions can be stated in terms of only one aspect of the game, the largest proportion of voters who agree on ...
متن کاملThe Borda Count and Dominance Solvable Voting Games
We analyse dominance solvability (by iterated elimination of weakly dominated strategies) of voting games with three candidates and provide sufficient and necessary conditions for the Borda Count to yield a unique winner. We find that Borda is the unique scoring rule that is dominance solvable both (i) under unanimous agreement on a best candidate and (ii) under unanimous agreement on a worst c...
متن کاملApproval Voting on Large Poisson Games ∗
Approval Voting is analyzed in a context of large elections with strategic voters, the Myerson’s Large Poisson Games. Three examples show that this voting rule does not always correctly aggregate preferences. The first one shows that a candidate ranked first by more than half of the voters need not be the Winner of the election under Approval voting. In the second one, we show that it can be th...
متن کاملDominance Solvable Games with Multiple Payoff Criteria
Two logically distinct and permissive extensions of iterative weak dominance are introduced for games with possibly vector-valued payoffs. The first, iterative partial dominance, builds on an easy-tocheck condition but may lead to solutions that do not include any (generalized) Nash equilibria. However, the second and intuitively more demanding extension, iterative essential dominance, is shown...
متن کاملExtrapolation in Games of Coordination and Dominance Solvable Games
We study extrapolation between games in a laboratory experiment. Participants in our experiment first play either the dominance solvable guessing game or a Coordination version of the guessing game for five rounds. Afterwards they play a 3x3 normal form game for ten rounds with random matching which is either a game solvable through iterated elimination of dominated strategies (IEDS), a pure Co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Public Economic Theory
سال: 2017
ISSN: 1097-3923
DOI: 10.1111/jpet.12251